Distributed convex optimization via continuous-time coordination algorithms with discrete-time communication

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distributed convex optimization via continuous-time coordination algorithms with discrete-time communication

This paper proposes a novel class of distributed continuous-time coordination algorithms to solve network optimization problems whose cost function is strictly convex and equal to a sum of local cost functions associated to the individual agents. We establish the exponential convergence of the proposed algorithm under (i) strongly connected and weight-balanced digraph topologies when the local ...

متن کامل

Continuous-time Distributed Convex Optimization with Set Constraints ⋆

We study a distributed convex optimization problem with set constraints. The objective function is a summation of strictly convex functions. Based on a multi-agent system formulation, we consider that each node is with continuous-time dynamics and can only access its local objective function. Meanwhile, each node is subject to a common convex set constraint. The nodes can exchange local informa...

متن کامل

Continuous time portfolio optimization

This paper presents dynamic portfolio model based on the Merton's optimal investment-consumption model, which combines dynamic synthetic put option using risk-free and risky assets. This paper is extended version of methodological paper published by Yuan Yao (2012). Because of the long history of the development of foreign financial market, with a variety of financial derivatives, the study on ...

متن کامل

Linear Time Varying MPC Based Path Planning of an Autonomous Vehicle via Convex Optimization

In this paper a new method is introduced for path planning of an autonomous vehicle. In this method, the environment is considered cluttered and with some uncertainty sources. Thus, the state of detected object should be estimated using an optimal filter. To do so, the state distribution is assumed Gaussian. Thus the state vector is estimated by a Kalman filter at each time step. The estimation...

متن کامل

Distributed Optimization in Multi-Agent Systems: Game Theory Based Sensor Coverage and Continuous-Time Convex Optimization

OF THE DISSERTATION Distributed Optimization in Multi-Agent Systems: Game Theory Based Sensor Coverage and continuous-time Convex Optimization by Salar Rahili Doctor of Philosophy, Graduate Program in Electrical Engineering University of California, Riverside, December 2016 Dr. Wei Ren, Chairperson A multi-agent system is defined as a collection of autonomous agents which are able to interact w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Automatica

سال: 2015

ISSN: 0005-1098

DOI: 10.1016/j.automatica.2015.03.001